Futurism e-visited

Forecasting & Futurism 4 th Annual Contest Submission

Detecting Areas Visited Regularly

We are given a trajectory T and an area A. T might intersect A several times, and our aim is to detect whether T visits A with some regularity, e.g. what is the longest time span that a GPS-GSM equipped elephant visited a specific lake on a daily (weekly or yearly) basis, where the elephant has to visit the lake most of the days (weeks or years), but not necessarily on every day (week or year)....

TCP performance re-visited

Detailed measurements and analyses for the Linux-2.4 TCP stack on current adapters and processors are presented. We describe the impact of CPU scaling and memory bus loading on TCP performance. As CPU speeds outstrip I/O and memory speeds, many generally accepted notions of TCP performance begin to unravel. In-depth examinations and explanations of previously held TCP performance truths are pro...

Utilization Bound Re-visited

Utilization bound is a well-known concept introduced in the seminal paper of Liu and Layland, which provides a simple and practical way to test the schedulability of a real-time task set. The original utilization bound for the fixed-priority scheduler was given as a function of the number of tasks in the periodic task set. In this paper, we define the utilization bound as a function of the info...

Iteration Functions re-visited

Two classes of Iteration Functions (IFs) are derived in this paper. The first (one-point IFs) was originally derived by Joseph Traub using a different approach to ours (simultaneous IFs). The second is new and is demonstrably shown to be more informationally efficient than the first. These IFs apply to polynomials with arbitrary complex coefficients and zeros, which can also be multiple.